P2PScheMe: a P2P scheduling mechanism for workflows in grid computing
Identifieur interne : 000578 ( Main/Exploration ); précédent : 000577; suivant : 000579P2PScheMe: a P2P scheduling mechanism for workflows in grid computing
Auteurs : João Marcelo U. De Alencar [Brésil] ; Rossana M. C. Andrade [Brésil] ; Windson Viana [Brésil] ; Bruno Schulze [Brésil]Source :
- Concurrency and Computation: Practice and Experience [ 1532-0626 ] ; 2012-09-10.
Abstract
Complex scientific experiments have a growing demand for computational resources, which are expensive to be acquired and maintained. Grid computing has emerged as the mainstream technology to solve this issue. Grids are also adequate for the execution of scientific workflows because they allow the use of heterogeneous and distributed resources. In spite of the progress in grid technology, there are challenges to overcome in workflow scheduling. For instance, centralized scheduling solutions may lead to performance degradation and to problems with scalability. Some scheduling approaches are partially distributed, keeping a few centralized components that may become bottlenecks. Other distributed solutions have a lack of flexibility in the definition of workflows, in which only the use of tasks as steps in the workflow is permitted not high level services. In this work, we present P2PScheMe, a scheduling mechanism for peer‐to‐peer execution of workflows based on the invocation of grid services. The proposal considers information regarding grid execution environment in order to allow workflow scheduling adaptation. This adaptation is performed according to user requirements of quality of service. In this paper, we describe how P2PScheMe works and provides a comparative analysis with existing solutions. Copyright © 2011 John Wiley & Sons, Ltd.
Url:
DOI: 10.1002/cpe.1899
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000335
- to stream Istex, to step Curation: 000335
- to stream Istex, to step Checkpoint: 000097
- to stream Main, to step Merge: 000579
- to stream Main, to step Curation: 000578
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">P2PScheMe: a P2P scheduling mechanism for workflows in grid computing</title><author><name sortKey="De Alencar, Joao Marcelo U" sort="De Alencar, Joao Marcelo U" uniqKey="De Alencar J" first="João Marcelo U." last="De Alencar">João Marcelo U. De Alencar</name></author><author><name sortKey="Andrade, Rossana M C" sort="Andrade, Rossana M C" uniqKey="Andrade R" first="Rossana M. C." last="Andrade">Rossana M. C. Andrade</name></author><author><name sortKey="Viana, Windson" sort="Viana, Windson" uniqKey="Viana W" first="Windson" last="Viana">Windson Viana</name></author><author><name sortKey="Schulze, Bruno" sort="Schulze, Bruno" uniqKey="Schulze B" first="Bruno" last="Schulze">Bruno Schulze</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:959048CE3757990B6B3EEB8078651EBDAACF3941</idno><date when="2012" year="2012">2012</date><idno type="doi">10.1002/cpe.1899</idno><idno type="url">https://api.istex.fr/document/959048CE3757990B6B3EEB8078651EBDAACF3941/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000335</idno><idno type="wicri:Area/Istex/Curation">000335</idno><idno type="wicri:Area/Istex/Checkpoint">000097</idno><idno type="wicri:doubleKey">1532-0626:2012:De Alencar J:p:pscheme:a</idno><idno type="wicri:Area/Main/Merge">000579</idno><idno type="wicri:Area/Main/Curation">000578</idno><idno type="wicri:Area/Main/Exploration">000578</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">P2PScheMe: a P2P scheduling mechanism for workflows in grid computing</title><author><name sortKey="De Alencar, Joao Marcelo U" sort="De Alencar, Joao Marcelo U" uniqKey="De Alencar J" first="João Marcelo U." last="De Alencar">João Marcelo U. De Alencar</name><affiliation wicri:level="2"><country xml:lang="fr">Brésil</country><wicri:regionArea>GREat ‐ Group of Computer Networks, Software Engineering and Systems, Federal University Of Ceará (GREat‐UFC), Fortaleza, CE</wicri:regionArea><placeName><region type="state">Ceará</region></placeName></affiliation><affiliation wicri:level="1"><country xml:lang="fr">Brésil</country><wicri:regionArea>Quixadá Campus Academic Department, UFC, CE, Quixadá</wicri:regionArea><wicri:noRegion>Quixadá</wicri:noRegion></affiliation><affiliation><wicri:noCountry code="subField">Brazil.E‐mail:</wicri:noCountry></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Brésil</country></affiliation></author><author><name sortKey="Andrade, Rossana M C" sort="Andrade, Rossana M C" uniqKey="Andrade R" first="Rossana M. C." last="Andrade">Rossana M. C. Andrade</name><affiliation wicri:level="2"><country xml:lang="fr">Brésil</country><wicri:regionArea>GREat ‐ Group of Computer Networks, Software Engineering and Systems, Federal University Of Ceará (GREat‐UFC), Fortaleza, CE</wicri:regionArea><placeName><region type="state">Ceará</region></placeName></affiliation><affiliation wicri:level="1"><country xml:lang="fr">Brésil</country><wicri:regionArea>Department Of Computer Science, UFC, CE, Fortaleza</wicri:regionArea><wicri:noRegion>Fortaleza</wicri:noRegion></affiliation></author><author><name sortKey="Viana, Windson" sort="Viana, Windson" uniqKey="Viana W" first="Windson" last="Viana">Windson Viana</name><affiliation wicri:level="2"><country xml:lang="fr">Brésil</country><wicri:regionArea>GREat ‐ Group of Computer Networks, Software Engineering and Systems, Federal University Of Ceará (GREat‐UFC), Fortaleza, CE</wicri:regionArea><placeName><region type="state">Ceará</region></placeName></affiliation><affiliation wicri:level="1"><country xml:lang="fr">Brésil</country><wicri:regionArea>UFC Virtual Institute, CE, Fortaleza</wicri:regionArea><wicri:noRegion>Fortaleza</wicri:noRegion></affiliation></author><author><name sortKey="Schulze, Bruno" sort="Schulze, Bruno" uniqKey="Schulze B" first="Bruno" last="Schulze">Bruno Schulze</name><affiliation wicri:level="1"><country xml:lang="fr">Brésil</country><wicri:regionArea>LNCC ‐ National Laboratory for Scientific Computing, RJ, Petrópolis</wicri:regionArea><wicri:noRegion>Petrópolis</wicri:noRegion></affiliation></author></analytic><monogr></monogr><series><title level="j">Concurrency and Computation: Practice and Experience</title><title level="j" type="abbrev">Concurrency Computat.: Pract. Exper.</title><idno type="ISSN">1532-0626</idno><idno type="eISSN">1532-0634</idno><imprint><publisher>John Wiley & Sons, Ltd</publisher><pubPlace>Chichester, UK</pubPlace><date type="published" when="2012-09-10">2012-09-10</date><biblScope unit="volume">24</biblScope><biblScope unit="issue">13</biblScope><biblScope unit="page" from="1478">1478</biblScope><biblScope unit="page" to="1496">1496</biblScope></imprint><idno type="ISSN">1532-0626</idno></series><idno type="istex">959048CE3757990B6B3EEB8078651EBDAACF3941</idno><idno type="DOI">10.1002/cpe.1899</idno><idno type="ArticleID">CPE1899</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">1532-0626</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract">Complex scientific experiments have a growing demand for computational resources, which are expensive to be acquired and maintained. Grid computing has emerged as the mainstream technology to solve this issue. Grids are also adequate for the execution of scientific workflows because they allow the use of heterogeneous and distributed resources. In spite of the progress in grid technology, there are challenges to overcome in workflow scheduling. For instance, centralized scheduling solutions may lead to performance degradation and to problems with scalability. Some scheduling approaches are partially distributed, keeping a few centralized components that may become bottlenecks. Other distributed solutions have a lack of flexibility in the definition of workflows, in which only the use of tasks as steps in the workflow is permitted not high level services. In this work, we present P2PScheMe, a scheduling mechanism for peer‐to‐peer execution of workflows based on the invocation of grid services. The proposal considers information regarding grid execution environment in order to allow workflow scheduling adaptation. This adaptation is performed according to user requirements of quality of service. In this paper, we describe how P2PScheMe works and provides a comparative analysis with existing solutions. Copyright © 2011 John Wiley & Sons, Ltd.</div></front></TEI><affiliations><list><country><li>Brésil</li></country><region><li>Ceará</li></region></list><tree><country name="Brésil"><region name="Ceará"><name sortKey="De Alencar, Joao Marcelo U" sort="De Alencar, Joao Marcelo U" uniqKey="De Alencar J" first="João Marcelo U." last="De Alencar">João Marcelo U. De Alencar</name></region><name sortKey="Andrade, Rossana M C" sort="Andrade, Rossana M C" uniqKey="Andrade R" first="Rossana M. C." last="Andrade">Rossana M. C. Andrade</name><name sortKey="Andrade, Rossana M C" sort="Andrade, Rossana M C" uniqKey="Andrade R" first="Rossana M. C." last="Andrade">Rossana M. C. Andrade</name><name sortKey="De Alencar, Joao Marcelo U" sort="De Alencar, Joao Marcelo U" uniqKey="De Alencar J" first="João Marcelo U." last="De Alencar">João Marcelo U. De Alencar</name><name sortKey="De Alencar, Joao Marcelo U" sort="De Alencar, Joao Marcelo U" uniqKey="De Alencar J" first="João Marcelo U." last="De Alencar">João Marcelo U. De Alencar</name><name sortKey="Schulze, Bruno" sort="Schulze, Bruno" uniqKey="Schulze B" first="Bruno" last="Schulze">Bruno Schulze</name><name sortKey="Viana, Windson" sort="Viana, Windson" uniqKey="Viana W" first="Windson" last="Viana">Windson Viana</name><name sortKey="Viana, Windson" sort="Viana, Windson" uniqKey="Viana W" first="Windson" last="Viana">Windson Viana</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/CyberinfraV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000578 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000578 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= CyberinfraV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:959048CE3757990B6B3EEB8078651EBDAACF3941
|texte= P2PScheMe: a P2P scheduling mechanism for workflows in grid computing
}}
| This area was generated with Dilib version V0.6.25. |  |